Edge Operations on Non-Crossing Spanning Trees
نویسندگان
چکیده
منابع مشابه
A quadratic distance bound on sliding between crossing-free spanning trees
Let S be a set of n points in the plane and let TS be the set of all crossing-free spanning trees of S. We show that any two trees in TS can be transformed into each other by O(n ) local and constant-size edge slide operations. No polynomial upper bound for this task has been known, but in [1] a bound of O(n log n) operations was conjectured.
متن کاملEnumerating Constrained Non-crossing Geometric Spanning Trees
In this paper we present an algorithm for enumerating without repetitions all non-crossing geometric spanning trees on a given set of n points in the plane under edge constraints (i.e., some edges are required to be included in spanning trees). We will first prove that a set of all edge-constrained non-crossing spanning trees is connected via remove-add flips, based on the constrained smallest ...
متن کاملiETA #1 Improved Fixed-Parameter Algorithms for Non-Crossing Subgraphs1
We consider the problem of computing non-crossing spanning trees in topological graphs. It is known that it is NP-hard to decide whether a topological graph has a noncrossing spanning tree, and that it is hard to approximate the minimum number of crossings in a spanning tree. We give improved fixed-parameter algorithms, where we use the number k of crossing edge pairs and the number μ of crossi...
متن کاملOn Non-crossing (Projected) Spanning Trees of 3D point sets
We study the problem of optimizing the spanning tree of a set of points in IR3, whose projection onto a given plane contains no crossing edges. Denoted by NCMST (which stands for non-crossing minimum spanning trees), this problem is defined as follows. Given a set of points P in IR and a plane F , find a spanning tree whose projection onto F contains no crossing edges and its length is minimum ...
متن کاملLower bounds on the maximum number of non-crossing acyclic graphs
This paper is a contribution to the problem of counting geometric graphs on point sets. More concretely, we look at the maximum numbers of non-crossing spanning trees and forests. We show that the so-called double chain point configuration of N points has Ω(12.52 ) noncrossing spanning trees and Ω(13.61 ) non-crossing forests. This improves the previous lower bounds on the maximum number of non...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000